A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ballBOYD, E. A.Operations research letters. 1997, Vol 20, Num 2, pp 59-63, issn 0167-6377Article

Some facets for an assignment problem with side constraintsRONNY ABOUDI; NEMHAUSER, G. L.Operations research. 1991, Vol 39, Num 2, pp 244-250, issn 0030-364XArticle

Lower subdifferentiability of quadratic functionsMARTINEZ-LEGAZ, J. E; ROMANO-RODRIGUEZ, S.Mathematical programming. 1993, Vol 60, Num 1, pp 93-113, issn 0025-5610Article

A cutting plane algorithm for minimum perfect 2-matehingsGRÖTSCHEL, M; HOLLAND, O.Computing (Wien. Print). 1987, Vol 39, Num 4, pp 327-344, issn 0010-485XArticle

Scatter search for project scheduling with resource availability costSATO YAMASHITA, Denise; AMARAL ARMENTANO, Vinicius; LAGUNA, Manuel et al.European journal of operational research. 2006, Vol 169, Num 2, pp 623-637, issn 0377-2217, 15 p.Article

Using selective orthonormalization to update the analytic center after addition of multiple cutsMITCHELL, J. E; RAMASWAMY, S.Journal of optimization theory and applications. 2005, Vol 125, Num 2, pp 431-451, issn 0022-3239, 21 p.Article

An approach for multiple criteria simulation optimization with application to turning operationLEE, Y.-H; SHIN, H.-M; YANG, B.-H et al.Computers & industrial engineering. 1996, Vol 30, Num 3, pp 375-386, issn 0360-8352Article

Canonical DC programming problem : outer approximation methods revisitedHOANG TUY.Operations research letters. 1995, Vol 18, Num 2, pp 99-106, issn 0167-6377Article

Mixing mixed-integer inequalitiesGÜNLÜK, Oktay; POCHET, Yves.Mathematical programming. 2001, Vol 90, Num 3, pp 429-457, issn 0025-5610Article

Finite master programs in regularized stochastic decompositionHIGLE, J. L; SUVRAJEET SEN.Mathematical programming. 1994, Vol 67, Num 2, pp 143-168, issn 0025-5610Article

Fractional programming by lower subdifferentiability techniquesBONCOMPTE, M; MARTINEZ-LEGAZ, J. E.Journal of optimization theory and applications. 1991, Vol 68, Num 1, pp 95-116, issn 0022-3239Article

The mixed cutting plane algorithm for all-integer programmingAUSTIN, L. M; RUPAREL, B. C.Computers & operations research. 1986, Vol 13, Num 4, pp 395-401, issn 0305-0548Article

Shallow, deep and very deep cuts in the analytic center cutting plane methodGOFFIN, J.-L; VIAL, J.-P.Mathematical programming. 1999, Vol 84, Num 1, pp 89-103, issn 0025-5610Article

Generalized fractional programming and cutting plane algorithmsBARROS, A. I; FRENK, J. B. G.Journal of optimization theory and applications. 1995, Vol 87, Num 1, pp 103-120, issn 0022-3239Article

Complexity estimates of some cutting plane methods based on the analytic barrierNESTEROV, YU.Mathematical programming. 1995, Vol 69, Num 1, pp 149-176, issn 0025-5610Article

Fenchel cutting planes for integer programsBOYD, E. A.Operations research. 1994, Vol 42, Num 1, pp 53-64, issn 0030-364XArticle

Polyhedral combinatorics in combinatorial optimizationGERARDS, A. M. H; KOLEN, A. W. J.Statistica neerlandica. 1987, Vol 41, Num 1, pp 1-25, issn 0039-0402Article

Solving general continuous single facility location problems by cutting planesPLASTRIA, F.European journal of operational research. 1987, Vol 29, Num 1, pp 98-110, issn 0377-2217Article

Complexity results for the gap inequalities for the max-cut problemGALLI, Laura; KAPARIS, Konstantinos; LETCHFORD, Adam N et al.Operations research letters. 2012, Vol 40, Num 3, pp 149-152, issn 0167-6377, 4 p.Article

Level function method for quasiconvex programmingXU, H.Journal of optimization theory and applications. 2001, Vol 108, Num 2, pp 407-437, issn 0022-3239Article

Bounds on the Chvátal rank of polytopes in the 0/1-cubeEISENBRAND, F; SCHULZ, A. S.Lecture notes in computer science. 1999, pp 137-150, issn 0302-9743, isbn 3-540-66019-4Conference Paper

Warm start of the primal-dual method applied in the cutting-plane schemeGONDZIO, J.Mathematical programming. 1998, Vol 83, Num 1, pp 125-143, issn 0025-5610Article

An analytic center cutting plane method for pseudomonotone variational inequalitiesGOFFIN, J.-L; MARCOTTE, P; ZHU, D et al.Operations research letters. 1997, Vol 20, Num 1, pp 1-6, issn 0167-6377Article

Gomory cuts revisitedBALAS, E; CERIA, S; CORNUEJOLS, G et al.Operations research letters. 1996, Vol 19, Num 1, pp 1-9, issn 0167-6377Article

Structure of a simple scheduling polyhedronQUEYRANNE, M.Mathematical programming. 1993, Vol 58, Num 2, pp 263-285, issn 0025-5610Article